An Improved Lower Bound for a Semi-on-line Bin Packing Problem
نویسندگان
چکیده
On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows the optimum value in advance.
منابع مشابه
An Improved Lower Bound for a Semi-on-line Bin Packing Problem
On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملAn Improved Lower Bound on First-Fit's Accommodating Ratio for the Unit Price Bin Packing Problem
The lower bound on First-Fit's accommodating ratio, for the Unit Price Bin Packing problem, is improved to 5=8.
متن کاملImproved lower bounds for the online bin stretching problem
We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem. We also present a lower bound, wit...
متن کاملResource augmented semi-online bounded space bin packing
We study on-line bounded space bin-packing in the resource augmentation model of competitive analysis. In this model, the on-line bounded space packing algorithm has to pack a list L of items with sizes in (0, 1], into a minimum number of bins of size b, b ≥ 1. A bounded space algorithm has the property that it only has a constant number of active bins available to accept items at any point dur...
متن کامل